Spiderman graph: Visibility in urban regions
نویسندگان
چکیده
منابع مشابه
Visibility graph motifs
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of visibility graph motifs, smaller substructures that appear with characteristic frequencies. We develop ...
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملa comparative analysis of sanandaj urban area examples, using isovist and visibility graph analysis
isovist and visibility graph analysis tools are used to quantify and measure the quality of space, and despite their lack of maturity and evolution, they are considered to be the future of space analysis tools by researchers. this study was undertaken with the purpose of introducing the aforementioned tools for analyzing sanandaj’s urban areas. in this study, four different urban areas in sanan...
متن کاملRouting on the Visibility Graph
We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let P be a set of n points in the plane and let S be a set of non-crossing line segments whose endpoints are in P . We present two deterministic 1-local O(1)-memory routing algorithms that are guaranteed to find a path of at most linea...
متن کاملUnsolved Problems in Visibility Graph Theory
The visibility graph is a fundamental structure studied in the field of computational geometry, and pose some special challenges [12, 26]. Apart from theoretical interests, visibility graphs has important applications also. Some of the early applications include computing Euclidean shortest paths in the presence of obstacles [36] and decomposing two-dimensional shapes into clusters [40]. For mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2014.10.004